Solving Minimum Steiner Tree Problem Using Generalized Distributed Learning Automata
نویسندگان
چکیده
Minimum Steiner tree problem in a weighted graph is to find a least cost sub tree in the graph such that it contains special vertices called terminal points. Since this problem belongs to NP-Complete problems, many approximate algorithms including genetic algorithms and ant colony strategies have been designed for solving it. In this paper, we propose an algorithm based on distributed learning automata for solving Minimum Steiner tree problem. Experimental results show that the proposed algorithm is superior to other existing algorithms.
منابع مشابه
Mobility-based Multicast Routing Algorithm in Wireless Mobile Ad-Hoc Networks: A Learning Automata Approach
In this paper, we propose a distributed learning automata-based algorithm to solve the multicast routing problem in wireless mobile ad-hoc networks. The proposed algorithm estimates the expected relative mobility of each host, by sampling its movement parameters in various epochs, to realistically predict its motion behavior, and takes advantage of the Steiner connected dominating set to form t...
متن کاملA Hybrid Algorithm for Solving Steiner Tree Problem
In this paper, a hybrid algorithm based on modified intelligent water drops algorithm and learning automata for solving Steiner tree problem is proposed. Since the Steiner tree problem is NP-hard, the aim of this paper is to design an algorithm to construct high quality Steiner trees in a short time which are suitable for real time multicast routing in networks. The global search and fast conve...
متن کاملSolving a tri-objective convergent product network using the Steiner tree
Considering convergent product as an important manufacturing technology for digital products, we integrate functions and sub-functions using a comprehensive fuzzy mathematical optimization process. To form the convergent product, a web-based fuzzy network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is to be a link betwe...
متن کاملWeighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs
In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementat...
متن کاملFast Optimal Algorithms for the Minimum Rectilinear Steiner Arborescence Problem
| In this paper, we present two optimal algorithms for solving the Minimum Rectilinear Steiner Arborescence (MRSA) Problem. The rst algorithm is a recursive branch-and-bound variant of the RSA heuristic by Rao et al. [14]. The second algorithm uses dynamic programming to avoid solving the same subproblemmore than once. Furthermore, both algorithms can be generalized to solve the All-Quadrant MR...
متن کامل